Fuzzy Optimality Equations for Perceptive MDPs
نویسندگان
چکیده
This paper is a sequel to Kurano et al [9], [10], in which the fuzzy perceptive models for optimal stopping or discounted Markov decision process are proposed and the methods of computing the corresponding fuzzy perceptive values are given. Here, we deal with the average case for Markov decisin processes with fuzzy perceptive transition matrices and characterize the optimal average expected reward, called the average perceptive value, by a fuzzy optimality equation. Also, we give a numerical example.
منابع مشابه
Fuzzy optimality relation for perceptive MDPs - the average case
This paper is a sequel to Kurano et al [9], [10], in which the fuzzy perceptive models for optimal stopping or discounted Markov decision process is given. We proposed a method of computing the corresponding fuzzy perceptive values. Here, we deal with the average case for Markov decision processes with fuzzy perceptive transition matrices and characterize the optimal average expected reward, ca...
متن کاملFuzzy Perceptive Values for MDPs with Discounting
In this paper, we formulate the fuzzy perceptive model for discounted Markov decision processes in which the perception for transition probabilities is described by fuzzy sets. The optimal expected reward, called a fuzzy perceptive value, is characterized and calculated by a new fuzzy relation. As a numerical example, a machine maintenance problem is considered.
متن کاملStochastic Dominance-Constrained Markov Decision Processes
We are interested in risk constraints for infinite horizon discrete time Markov decision processes (MDPs). Starting with average reward MDPs, we show that increasing concave stochastic dominance constraints on the empirical distribution of reward lead to linear constraints on occupation measures. An optimal policy for the resulting class of dominance-constrained MDPs is obtained by solving a li...
متن کاملThe n th-Order Bias Optimality for Multichain Markov Decision Processes
The paper proposes a new approach to the theory of Markov decision processes (MDPs) with average performance criteria and finite state and action spaces. Using the average performance and bias difference formulas derived in this paper, we develop an optimization theory for average performance (or gain) optimality, bias optimality, and all the high-order bias optimality, in a unified way. The ap...
متن کاملOn the Reduction of Total-Cost and Average-Cost MDPs to Discounted MDPs
This paper provides conditions under which total-cost and average-cost Markov decision processes (MDPs) can be reduced to discounted ones. Results are given for transient total-cost MDPs with transition rates whose values may be greater than one, as well as for average-cost MDPs with transition probabilities satisfying the condition that there is a state such that the expected time to reach it ...
متن کامل